ARPANI@BIT_DURG: KBP English Slot-filling Task Challenge

نویسندگان

  • Arpana Rawal
  • Ani Thomas
  • M. K. Kowar
  • Sanjay Sharma
چکیده

The present communication laid by the above mentioned TAC-SF Track participants aims to report TAC forum about the system-incorporated towards Slot-Filling task. Given a list of PER / ORG relevant attributes, the task aimed at extracting Noun-phrases that fit as assigned values to these attributes, as narrated either in one or more relevant pools of newswires or described as declarative and / or factual information in supporting knowledge-base. For accomplishing above, care was taken to identify such slot-fill patterns from every instance of relevant context whether in newswire or knowledge-base. Hence, the system relied upon generating exhaustive supporting vocabulary patterns that associate with desired slot-patterns in semantic sense. Three different kinds of sources were used to build entity-relevant vocabulary in the Task Challenge so as to search for the precise information about the entity-attributes (may be single-valued or multiple valued) mentioned in Slot-fill track task definition. The team’s spirits feels elevated at the thought of using the free text from the Wikipedia pages associated with the knowledge base nodes, while building the evaluation model as it adds to the robustness and reliability of the system even at the time of inaccessibility of the Web.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Overview of the TAC2013 Knowledge Base Population Evaluation: English Slot Filling and Temporal Slot Filling

We overview two tracks of the TAC2013 Knowledge Base Population (KBP) evaluation: English slot filling (SF) and temporal slot filling (TSF). The goal of these two KBP tracks is to promote research in the extraction of relations between named entities from free text (SF), and identify the temporal intervals when these relations were valid (TSF). The main changes this year include the requirement...

متن کامل

CornPittMich Sentiment Slot-Filling System at TAC 2013

We describe the 2013 system of the CornPittMich team for the KBP English Sentiment Slot-Filling (SSF) task. The central components of the architecture are two fine-grained opinion analysis systems. For each query, we select the top N documents based on a document-level relevance measure, and process each sentence therein to identify expressions of sentiment along with their source and target. T...

متن کامل

NLPComp in TAC 2012 Entity Linking and Slot-Filling

The NLPComp team participated in two TACKBP2012 tasks: Regular Entity Linking and Regular Slot Filling. For the entity linking task, a three-step entity linking system is developed. In the first step, a list of possible candidates are selected. Then the best candidate is identified to decide whether a link exists. In addition, a document clustering algorithm is used to group NIL queries. This s...

متن کامل

Collective Entity Linking and a Simple Slot Filling Method for TAC-KBP 2011

This paper summarize our work in TAC2010 knowledge base population track. We submit result for english entity linking and regular slot filling task. For entity linking we use a frequency based method as baseline and implement a collective method following (Han et al., 2011) for entity linking. For slot filling, we use wikipedia infobox as a source of supervision by mapping back to sentences to ...

متن کامل

BUPT_PRIS at TREC 2014 Knowledge Base Acceleration Track

This paper describes the system in Vital Filtering and Streaming Slot Filling task of TREC 2014 Knowledge Base Acceleration Track. In the Vital Filtering task, The PRIS system focuses attention on query expansion and similarity calculation. The system uses DBpedia as external source data to do query expansion and generates directional documents to calculate similarities with candidate worth cit...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013